Epistemic semantics for classical and intuitionistic logic
نویسنده
چکیده
1 In this paper I propose to explain how several nonstandard semantic systems for the propositional logic can be seen as employing essentially the same principles for defining the notion of logical entailment and the more basic idea of assignment of truth-values to molecular sentences. The systems are Kleene's three-valued matrix for the strong connectives, Lukasiewicz's three-valued matrix, supervaluations, and Beth's semantics for intuitionistic logic. Traditionally these systems have been viewed as dividing into two quite different approaches to semantic theory depending on the philosophical interpretation of the truth-values which they employ. Classical bivalent semantics, supervaluations, Lukasiewicz's three-valued logic, and frequently Kleene's strong connectives are presented as varieties of what Dummett calls realism, the view that truth-values and their informal readings are properly analyzed in terms of a correspondence theory of truth in which sentences are understood to describe a real world. Intuitionism and the strong connectives as Kleene originally interprets them represent varieties of antirealism or epistemic semantics. Intuitionistic semantics is bivalent; an assignment of T represents the epistemic fact that a sentence is provable and one of F the fact that it is not provable. Kleene represents essentially the same constructivist notion of acceptability, but he uses the narrower concept of effectively decidable—in his words, "decidable by the algorithms"—and elects to represent the possibilities in terms of three values: a sentence is assigned T if it is effectively decidable, F if its negation is, and TV if neither it nor its negation is. (In the presentation below Beth's bivalent semantics are recast similarly into a trivially equivalent three-valued format.)
منابع مشابه
Epistemic extensions of combined classical and intuitionistic propositional logic
Logic L was introduced by Lewitzka [8] as a modal system that combines intuitionistic and classical logic: L is a conservative extension of CPC and it contains a copy of IPC via embedding φ 7→ φ. In this article, we consider L3, i.e. L augmented with S3 modal axioms, define basic epistemic extensions and prove completeness w.r.t. algebraic semantics. Our systems involve, in adapted form, some o...
متن کاملBilattice Public Announcement Logic
Building on recent work on bilattice modal logic and extensions of public announcement logic to a non-classical setting, we introduce a dynamic epistemic logic having the logic of modal bilattices as propositional support. Bilattice logic is both inconsistency-tolerant and paracomplete, thus suited for applications in contexts with multiple sources of information, where one may have to deal wit...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملAn Intuitionistic Epistemic Logic for Sequential Consistency on Shared Memory
In the celebrated Gödel Prize winning papers, Herlihy, Shavit, Saks and Zaharoglou gave topological characterization of waitfree computation. In this paper, we characterize waitfree communication logically. First, we give an intuitionistic epistemic logic K∨ for asynchronous communication. The semantics for the logic K∨ is an abstraction of Herlihy and Shavit’s topological model. In the same wa...
متن کاملProof Theory, Modal Logic and Reflection Principles
Sergei Artemov Reflection vs. co-Reflection in Intuitionistic Epistemic Logic. This is joint work with Tudor Protopopescu. We outline an intuitionistic view of knowledge which maintains the Brouwer-Heyting-Kolmogorov semantics and is consistent with Williamson’s suggestion that intuitionistic knowledge is the result of verification. On this view, co-Reflection F → KF is valid since it encodes a...
متن کاملReasoning about proof and knowledge
In previous work [Lewitzka, 2017], we presented a hierarchy of classical modal logics, along with algebraic semantics, for the reasoning about intuitionistic truth (i.e. proof), belief and knowledge. Interpreting as a proof predicate, the systems also express properties of intuitionistic belief and knowledge established in [Artemov and Protopopescu, 2016] where epistemic principles are in line ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 25 شماره
صفحات -
تاریخ انتشار 1984